Asymptotic convergence of metaheuristics for multiobjective optimization problems

نویسندگان

  • Mario Villalobos-Arias
  • Carlos A. Coello Coello
  • Onésimo Hernández-Lerma
چکیده

This paper analyzes the convergence of metaheuristics used for multiobjective optimization problems in which the transition probabilities use a uniform mutation rule. We prove that these algorithms converge only if elitism is used.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Multi-objective optimization using metaheuristics: non-standard algorithms

In recent years, the application of metaheuristic techniques to solve multi-objective optimization problems (MOPs) has become an active research area. Solving these kinds of problems involves obtaining a set of Pareto-optimal solutions in such a way that the corresponding Pareto front fulfills the requirements of convergence to the true Pareto front and uniform diversity. Most studies on metahe...

متن کامل

A COMPRATIVE STUDY OF THREE METAHEURISTICS FOR OPTIMUM DESIGN OF TRUSSES

In the present study, the computational performance of the particle swarm optimization (PSO) harmony search (HS) and firefly algorithm (FA), as popular metaheuristics, is investigated for size and shape optimization of truss structures. The PSO was inspired by the social behavior of organisms such as bird flocking. The HS imitates the musical performance process which takes place when a musicia...

متن کامل

Flower Pollination Algorithm: A Novel Approach for Multiobjective Optimization

Multiobjective design optimization problems require multiobjective optimization techniques to solve, and it is often very challenging to obtain high-quality Pareto fronts accurately. In this paper, the recently developed flower pollination algorithm (FPA) is extended to solve multiobjective optimization problems. The proposed method is used to solve a set of multobjective test functions and two...

متن کامل

An Introduction to Multiobjective Metaheuristics for Scheduling and Timetabling

In many real-world scheduling problems (eg. machine scheduling, educational timetabling, personnel scheduling, etc.) several criteria must be considered simultaneously when evaluating the quality of the solution or schedule. Among these criteria there are: length of the schedule, utilisation of resources, satisfaction of people’s preferences and compliance with regulations. Traditionally, these...

متن کامل

Multiobjective Fitness Landscape Analysis and the Design of Effective Memetic

J. Deon Garrett. Ph.D. The University of Memphis. February, 2008. Multiobjective Fitness Landscape Analysis and the Design of Effective Memetic Algorithms. Major Professor: Dipankar Dasgupta, Ph.D. For a wide variety of combinatorial optimization problems, no efficient algorithms exist to exactly solve the problem unless P=NP. For these problems, metaheuristics have come to dominate the landsca...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Soft Comput.

دوره 10  شماره 

صفحات  -

تاریخ انتشار 2006